TSTP Solution File: ITP037^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP037^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 22:16:00 EDT 2024

% Result   : Theorem 0.19s 0.50s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   13 (   8 unt;   5 typ;   0 def)
%            Number of atoms       :    8 (   0 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   17 (   3   ~;   0   |;   0   &;  14   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   4 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :    3 (   0   ^   3   !;   0   ?;   3   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    trm_a_c: $tType ).

thf(decl_sort2,type,
    c: $tType ).

thf(decl_112,type,
    dfree_a_c: trm_a_c > $o ).

thf(decl_157,type,
    args: c > trm_a_c ).

thf(decl_158,type,
    i2: c ).

thf(conj_0,conjecture,
    dfree_a_c @ ( args @ i2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

thf(fact_0_free,axiom,
    ! [X1: c] : ( dfree_a_c @ ( args @ X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_free) ).

thf(c_0_2,negated_conjecture,
    ~ ( dfree_a_c @ ( args @ i2 ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_3,negated_conjecture,
    ~ ( dfree_a_c @ ( args @ i2 ) ),
    inference(fof_nnf,[status(thm)],[c_0_2]) ).

thf(c_0_4,plain,
    ! [X767: c] : ( dfree_a_c @ ( args @ X767 ) ),
    inference(variable_rename,[status(thm)],[fact_0_free]) ).

thf(c_0_5,negated_conjecture,
    ~ ( dfree_a_c @ ( args @ i2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,plain,
    ! [X1: c] : ( dfree_a_c @ ( args @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : ITP037^1 : TPTP v8.2.0. Released v7.5.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat May 18 16:31:37 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.46  Running higher-order theorem proving
% 0.19/0.47  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.50  # Version: 3.1.0-ho
% 0.19/0.50  # Preprocessing class: HSLMSMSMSSMNHFA.
% 0.19/0.50  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting full_lambda_6 with 1200s (4) cores
% 0.19/0.50  # Starting additional_ho_6 with 300s (1) cores
% 0.19/0.50  # Starting new_ho_9 with 300s (1) cores
% 0.19/0.50  # Starting full_lambda_3 with 300s (1) cores
% 0.19/0.50  # Starting post_as_ho6 with 300s (1) cores
% 0.19/0.50  # full_lambda_3 with pid 8071 completed with status 0
% 0.19/0.50  # Result found by full_lambda_3
% 0.19/0.50  # Preprocessing class: HSLMSMSMSSMNHFA.
% 0.19/0.50  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting full_lambda_6 with 1200s (4) cores
% 0.19/0.50  # Starting additional_ho_6 with 300s (1) cores
% 0.19/0.50  # Starting new_ho_9 with 300s (1) cores
% 0.19/0.50  # Starting full_lambda_3 with 300s (1) cores
% 0.19/0.50  # SinE strategy is GSinE(CountTerms,hypos,1.5,,2,20000,1.0)
% 0.19/0.50  # Search class: HHUNF-FFSF11-SHFFFFNN
% 0.19/0.50  # partial match(1): HHUNF-FFSF11-SFFFFFNN
% 0.19/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50  # Starting new_ho_10 with 163s (1) cores
% 0.19/0.50  # new_ho_10 with pid 8073 completed with status 0
% 0.19/0.50  # Result found by new_ho_10
% 0.19/0.50  # Preprocessing class: HSLMSMSMSSMNHFA.
% 0.19/0.50  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting full_lambda_6 with 1200s (4) cores
% 0.19/0.50  # Starting additional_ho_6 with 300s (1) cores
% 0.19/0.50  # Starting new_ho_9 with 300s (1) cores
% 0.19/0.50  # Starting full_lambda_3 with 300s (1) cores
% 0.19/0.50  # SinE strategy is GSinE(CountTerms,hypos,1.5,,2,20000,1.0)
% 0.19/0.50  # Search class: HHUNF-FFSF11-SHFFFFNN
% 0.19/0.50  # partial match(1): HHUNF-FFSF11-SFFFFFNN
% 0.19/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50  # Starting new_ho_10 with 163s (1) cores
% 0.19/0.50  # Preprocessing time       : 0.003 s
% 0.19/0.50  # Presaturation interreduction done
% 0.19/0.50  
% 0.19/0.50  # Proof found!
% 0.19/0.50  # SZS status Theorem
% 0.19/0.50  # SZS output start CNFRefutation
% See solution above
% 0.19/0.50  # Parsed axioms                        : 550
% 0.19/0.50  # Removed by relevancy pruning/SinE    : 547
% 0.19/0.50  # Initial clauses                      : 3
% 0.19/0.50  # Removed in clause preprocessing      : 0
% 0.19/0.50  # Initial clauses in saturation        : 3
% 0.19/0.50  # Processed clauses                    : 2
% 0.19/0.50  # ...of these trivial                  : 0
% 0.19/0.50  # ...subsumed                          : 0
% 0.19/0.50  # ...remaining for further processing  : 2
% 0.19/0.50  # Other redundant clauses eliminated   : 0
% 0.19/0.50  # Clauses deleted for lack of memory   : 0
% 0.19/0.50  # Backward-subsumed                    : 0
% 0.19/0.50  # Backward-rewritten                   : 1
% 0.19/0.50  # Generated clauses                    : 0
% 0.19/0.50  # ...of the previous two non-redundant : 0
% 0.19/0.50  # ...aggressively subsumed             : 0
% 0.19/0.50  # Contextual simplify-reflections      : 0
% 0.19/0.50  # Paramodulations                      : 0
% 0.19/0.50  # Factorizations                       : 0
% 0.19/0.50  # NegExts                              : 0
% 0.19/0.50  # Equation resolutions                 : 0
% 0.19/0.50  # Disequality decompositions           : 0
% 0.19/0.50  # Total rewrite steps                  : 1
% 0.19/0.50  # ...of those cached                   : 0
% 0.19/0.50  # Propositional unsat checks           : 0
% 0.19/0.50  #    Propositional check models        : 0
% 0.19/0.50  #    Propositional check unsatisfiable : 0
% 0.19/0.50  #    Propositional clauses             : 0
% 0.19/0.50  #    Propositional clauses after purity: 0
% 0.19/0.50  #    Propositional unsat core size     : 0
% 0.19/0.50  #    Propositional preprocessing time  : 0.000
% 0.19/0.50  #    Propositional encoding time       : 0.000
% 0.19/0.50  #    Propositional solver time         : 0.000
% 0.19/0.50  #    Success case prop preproc time    : 0.000
% 0.19/0.50  #    Success case prop encoding time   : 0.000
% 0.19/0.50  #    Success case prop solver time     : 0.000
% 0.19/0.50  # Current number of processed clauses  : 1
% 0.19/0.50  #    Positive orientable unit clauses  : 1
% 0.19/0.50  #    Positive unorientable unit clauses: 0
% 0.19/0.50  #    Negative unit clauses             : 0
% 0.19/0.50  #    Non-unit-clauses                  : 0
% 0.19/0.50  # Current number of unprocessed clauses: 1
% 0.19/0.50  # ...number of literals in the above   : 2
% 0.19/0.50  # Current number of archived formulas  : 0
% 0.19/0.50  # Current number of archived clauses   : 1
% 0.19/0.50  # Clause-clause subsumption calls (NU) : 0
% 0.19/0.50  # Rec. Clause-clause subsumption calls : 0
% 0.19/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.50  # Unit Clause-clause subsumption calls : 0
% 0.19/0.50  # Rewrite failures with RHS unbound    : 0
% 0.19/0.50  # BW rewrite match attempts            : 1
% 0.19/0.50  # BW rewrite match successes           : 1
% 0.19/0.50  # Condensation attempts                : 2
% 0.19/0.50  # Condensation successes               : 0
% 0.19/0.50  # Termbank termtop insertions          : 5063
% 0.19/0.50  # Search garbage collected termcells   : 3474
% 0.19/0.50  
% 0.19/0.50  # -------------------------------------------------
% 0.19/0.50  # User time                : 0.003 s
% 0.19/0.50  # System time              : 0.006 s
% 0.19/0.50  # Total time               : 0.009 s
% 0.19/0.50  # Maximum resident set size: 3152 pages
% 0.19/0.50  
% 0.19/0.50  # -------------------------------------------------
% 0.19/0.50  # User time                : 0.021 s
% 0.19/0.50  # System time              : 0.007 s
% 0.19/0.50  # Total time               : 0.028 s
% 0.19/0.50  # Maximum resident set size: 2792 pages
% 0.19/0.50  % E---3.1 exiting
% 0.19/0.50  % E exiting
%------------------------------------------------------------------------------